Bounded point evaluations and balayage

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

L-bounded Point Evaluations for Polynomials and Uniform Rational Approximation

A connection is established between uniform rational approximation and approximation in the mean by polynomials on compact nowhere dense subsets of the complex plane C. Peak points for R(X) and bounded point evaluations for Hp(X, dA), 1 ≤ p < ∞, play a fundamental role.

متن کامل

Generalized Bounded Variation and Inserting Point Masses

Abstract. Let dμ be a probability measure on the unit circle and dν be the measure formed by adding a pure point to dμ. We give a simple formula for the Verblunsky coefficients of dν based on a result of Simon. Then we consider dμ0, a probability measure on the unit circle with l Verblunsky coefficients (αn(dμ0)) ∞ n=0 of bounded variation. We insert m pure points to dμ, rescale, and form the p...

متن کامل

Asymptotic Balayage in Hardy and Bergman Spaces

For a range of Hardy and Bergman spaces X and sets of uniqueness K we show that for any functional φ ∈ X∗ there exists a sequence of measures (μn) supported on K converging weak* to φ. In particular, we consider H2 of the right half plane and obtain a Carleman–type formula for the continuous wavelet transform.

متن کامل

Bounded-degree polyhedronization of point sets

In 1994 Grünbaum showed that, given a point set S in R, it is always possible to construct a polyhedron whose vertices are exactly S. Such a polyhedron is called a polyhedronization of S. Agarwal et al. extended this work in 2008 by showing that there always exists a polyhedronization that can be decomposed into a union of tetrahedra (tetrahedralizable). In the same work they introduced the not...

متن کامل

Entropy-Bounded Representation of Point Grids

We give the first fully compressed representation of a set of m points on an n×n grid, taking H+o(H) bits of space, where H = lg ( n m ) is the entropy of the set. This representation supports range counting, range reporting, and point selection queries, with a performance that is comparable to that of uncompressed structures and that improves upon the only previous compressed structure. Operat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arkiv för Matematik

سال: 1982

ISSN: 0004-2080

DOI: 10.1007/bf02390505